package algorithms.dynamicProgram;

/**
 *
 */
public class LeetCode_70 {

    public static void main(String[] args) {

        System.out.println(fib(3));
        System.out.println(fib(3));

    }


    public static int climbStairs(int n) {
        if (n <= 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[1] = 1;
        dp[2] = 2;

        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];


    }

    public static int fib(int n) {
        if (n <= 2) {
            return n-1;
        }
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;

        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
}
